Fitting the linear preferential attachment model
نویسندگان
چکیده
منابع مشابه
The preferential attachment model∗
Many empirically studied networks have approximately so-called power-law or scale-free degree distributions. In Section 1 we formally define such distributions and explore some of their properties. We also introduce and briefly compare two methods for constructing random networks with approximately power-law degree distributions: generic scale-free networks and the preferential attachment model...
متن کاملA Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, x2, . . . , xn chosen uniformly at random from the unit sphere in R . After generating xt, we randomly connect it to m points from those points in x1, x2, . . . , xt−1 which are within distance r. Neighbors are chosen ...
متن کاملClustering Properties of Spatial Preferential Attachment Model
In this paper, we study the clustering properties of the Spatial Preferential Attachment (SPA) model introduced by Aiello et al. in 2009. This model naturally combines geometry and preferential attachment using the notion of spheres of influence. It was previously shown in several research papers that graphs generated by the SPA model are similar to real-world networks in many aspects. For exam...
متن کاملConnectivity Transitions in Networks with Super-Linear Preferential Attachment
We analyze an evolving network model of Krapivsky and Redner in which new nodes arrive sequentially, each connecting to a previously existing node b with probability proportional to the pth power of the in-degree of b. We restrict to the super-linear case p > 1. When 1+ 1 k < p < 1+ 1 k−1 , the structure of the final countable tree is determined. There is a finite tree T with distinguished v (w...
متن کاملPerfect matchings and Hamiltonian cycles in the preferential attachment model
In this paper, we study the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model. In this model, vertices are added to the graph one by one, and each time a new vertex is created it establishes a connection with m random vertices selected with probabilities proportional to their current degrees. (Constant m is the only parameter of the model.) We prove that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2017
ISSN: 1935-7524
DOI: 10.1214/17-ejs1327